Massive Domain Wall Fermions on Four-dimensional Anisotropic Lattices

We formulate the massive domain wall fermions on anisotropic lattices. For the massive domain wall fermion, we find that the dispersion relation assumes the usual form in the low momentum region when the bare parameters are properly tuned. The quark self-energy and the quark field renormalization constants are calculated to one-loop in bare lattice perturbation theory. For light domain wall fermions, we verified that the chiral mode is stable against quantum fluctuations on anisotropic lattices. This calculation serves as a guidance for the tuning of the parameters in the quark action in future numerical simulations.Comment: 36 pages, 14 figures, references adde

Lattice study on kaon nucleon scattering length in the I=1 channel

Using the tadpole improved clover Wilson quark action on small, coarse and anisotropic lattices, $KN$ scattering length in the I=1 channel is calculated within quenched approximation. The results are extrapolated towards the chiral and physical kaon mass region. Finite volume and finite lattice spacing errors are also analyzed and a result in the infinite volume and continuum limit is obtained which is compatible with the experiment and the results from Chiral Perturbation Theory.Comment: 15 pages, 4 figures, typeset by latex using elsart.cls,minor change

A Functional Taxonomy of Music Generation Systems

Digital advances have transformed the face of automatic music generation since its beginnings at the dawn of computing. Despite the many breakthroughs, issues such as the musical tasks targeted by different machines and the degree to which they succeed remain open questions. We present a functional taxonomy for music generation systems with reference to existing systems. The taxonomy organizes systems according to the purposes for which they were designed. It also reveals the inter-relatedness amongst the systems. This design-centered approach contrasts with predominant methods-based surveys and facilitates the identification of grand challenges to set the stage for new breakthroughs.Comment: survey, music generation, taxonomy, functional survey, survey, automatic composition, algorithmic compositio

Probabilistic teleportation and entanglement matching

Teleportation may be taken as sending and extracting quantum information through quantum channels. In this report, it is shown that to get the maximal probability of exact teleportation through partially entangled quantum channels, the sender (Alice) need only to operate a measurement which satisfy an ``entanglement matching'' to this channel. An optimal strategy is also provided for the receiver (Bob) to extract the quantum information by adopting general evolutions.Comment: 3.5 pages, No figure

Solvable Systems of Linear Differential Equations

The asymptotic iteration method (AIM) is an iterative technique used to find exact and approximate solutions to second-order linear differential equations. In this work, we employed AIM to solve systems of two first-order linear differential equations. The termination criteria of AIM will be re-examined and the whole theory is re-worked in order to fit this new application. As a result of our investigation, an interesting connection between the solution of linear systems and the solution of Riccati equations is established. Further, new classes of exactly solvable systems of linear differential equations with variable coefficients are obtained. The method discussed allow to construct many solvable classes through a simple procedure.Comment: 13 page

Repeat-Until-Success quantum computing using stationary and flying qubits

We introduce an architecture for robust and scalable quantum computation using both stationary qubits (e.g. single photon sources made out of trapped atoms, molecules, ions, quantum dots, or defect centers in solids) and flying qubits (e.g. photons). Our scheme solves some of the most pressing problems in existing non-hybrid proposals, which include the difficulty of scaling conventional stationary qubit approaches, and the lack of practical means for storing single photons in linear optics setups. We combine elements of two previous proposals for distributed quantum computing, namely the efficient photon-loss tolerant build up of cluster states by Barrett and Kok [Phys. Rev. A 71, 060310(R) (2005)] with the idea of Repeat-Until-Success (RUS) quantum computing by Lim et al. [Phys. Rev. Lett. 95, 030505 (2005)]. This idea can be used to perform eventually deterministic two-qubit logic gates on spatially separated stationary qubits via photon pair measurements. Under non-ideal conditions, where photon loss is a possibility, the resulting gates can still be used to build graph states for one-way quantum computing. In this paper, we describe the RUS method, present possible experimental realizations, and analyse the generation of graph states.Comment: 14 pages, 7 figures, minor changes, references and a discussion on the effect of photon dark counts adde

Comment on "Quantum key distribution without alternative measurements"

In a recent paper [A. Cabello, Phys. Rev. A 61, 052312 (2000)], a quantum key distribution protocol based on entanglement swapping was proposed. However, in this comment, it is shown that this protocol is insecure if Eve use a special strategy to attack.Comment: 2 Pages, 1 Figur

Quantum key distribution via quantum encryption

A quantum key distribution protocol based on quantum encryption is presented in this Brief Report. In this protocol, the previously shared Einstein-Podolsky-Rosen pairs act as the quantum key to encode and decode the classical cryptography key. The quantum key is reusable and the eavesdropper cannot elicit any information from the particle Alice sends to Bob. The concept of quantum encryption is also discussed.Comment: 4 Pages, No Figure. Final version to appear in PR